منابع مشابه
The locating-chromatic number for Halin graphs
Let G be a connected graph. Let f be a proper k -coloring of G and Π = (R_1, R_2, . . . , R_k) bean ordered partition of V (G) into color classes. For any vertex v of G, define the color code c_Π(v) of v with respect to Π to be a k -tuple (d(v, R_1), d(v, R_2), . . . , d(v, R_k)), where d(v, R_i) is the min{d(v, x)|x ∈ R_i}. If distinct vertices have distinct color codes, then we call f a locat...
متن کامل3 - Chromatic Cubic Graphs with Complementary Connected Domination Number Three
Let G (V, E) be a graph. A subset S of V is called a dominating set of G if every vertex in V-S is adjacent to at least one vertex in S. The domination number γ (G) is the minimum cardinality taken over all such dominating sets in G. A subset S of V is said to be a complementary connected dominating set (ccd-set) if S is a dominating set and < V-S > is connected. The chromatic number χ is the m...
متن کاملThe locating chromatic number of the join of graphs
Let $f$ be a proper $k$-coloring of a connected graph $G$ and $Pi=(V_1,V_2,ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $Pi$ is defined to be the ordered $k$-tuple $c_{{}_Pi}(v)=(d(v,V_1),d(v,V_2),ldots,d(v,V_k))$, where $d(v,V_i)=min{d(v,x):~xin V_i}, 1leq ileq k$. If distinct...
متن کاملThe b-chromatic number of some power graphs
Let G be a graph on vertices v1,v2, . . . ,vn. The b-chromatic number of G is defined as the maximum number k of colors that can be used to color the vertices of G, such that we obtain a proper coloring and each color i, with 1≤ i≤ k, has at least one representant xi adjacent to a vertex of every color j, 1 ≤ j 6= i ≤ k. In this paper, we give the exact value for the b-chromatic number of power...
متن کاملOn the Chromatic Number of some Flip Graphs
In this paper we study the chromatic number of the following four flip graphs: A graph on the perfect matchings of the complete graph on 2n vertices and three graphs on the triangulations, Hamiltonian geometric non-crossing paths, and triangles respectively of a point set in convex position in the plane. We give tight bounds for the latter two cases and upper bounds for the first two.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1979
ISSN: 0095-8956
DOI: 10.1016/0095-8956(79)90006-6